Exclusion in a priority queue

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Finite Capacity Priority Queue with Discouragement

In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...

متن کامل

Priority queue classes with priority update

A limitation in the design of the interface of C++ standard priority queues is addressed. The use of priority queues in Dijkstra’s shortest path search algorithm is used as an example. Priority queues are often implemented using heaps. There is a problem, as it may be necessary to change the priority of an element while it is in the queue, but finding the element from within a heap is costly. T...

متن کامل

Composite Priority Queue

This paper presents formulas for calculating waiting time for customers in a queue with combined preemptive and head-ofline (nonpreemptive) priority scheduling disciplines and describes the reasoning behind them. This work has been applied in the development of programmable terminal control units. Introduction The development of programmable terminal control units has created the need for a new...

متن کامل

2 Priority Queue

In the last lecture, we discussed algorithms for integer sorting. In this lecture we will discuss the relationship between integer sorting algorithms and priority queue data structures. It is obvious that fast priority queues imply fast sorting, since if a priority queue can do Insert and Deletemin in O(f(n)), then we can sort in O(nf(n)) by inserting all elements into the queue then calling De...

متن کامل

The Permutational Power of a Priority Queue

A priority queue transforms an input permutation cr of some set of size n into an output permutation z. It is shown that the number of such pairs (a, z) is (n + 1)"1 Some related enumerative and algorithmic questions are also considered.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2014

ISSN: 1742-5468

DOI: 10.1088/1742-5468/2014/07/p07014